An allocation rule for dynamic random network formation processes⋆

نویسندگان

  • Jean-François Caulier
  • Michel Grabisch
  • Agnieszka Rusinowska
چکیده

Most allocation rules for network games presented in the literature assume that the network structure is fixed. We put explicit emphasis on the construction of networks and examine the dynamic formation of networks whose evolution across time periods is stochastic. Time-series of networks are studied that describe processes of network formation where links may appear or disappear at any period. Moreover, convergence to an efficient network is not necessarily prescribed. Transitions from one network to another are random and ruled by a stochastic process, typically a Markov chain. We propose the link-based scenario allocation rule for such dynamic random network formation processes and provide its axiomatic characterization. By considering a monotone game and a particular (natural) network formation process we recover the link-based flexible network allocation rule of Jackson (2005a). JEL Classification: C71, D85

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A heuristic method for consumable resource allocation in multi-class dynamic PERT networks

This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a n...

متن کامل

An Intelligent Algorithm for Optimization of Resource Allocation Problem by Considering Human Error in an Emergency Department

Human error is a significant and ever-growing problem in the healthcare sector. In this study, resource allocation problem is considered along with human errors to optimize utilization of resources in an emergency department. The algorithm is composed of simulation, artificial neural network (ANN), design of experiment (DOE) and fuzzy data envelopment analysis (FDEA). It is a multi-response opt...

متن کامل

Expected Duration of Dynamic Markov PERT Networks

Abstract : In this paper , we apply the stochastic dynamic programming to approximate the mean project completion time in dynamic Markov PERT networks. It is assumed that the activity durations are independent random variables with exponential distributions, but some social and economical problems influence the mean of activity durations. It is also assumed that the social problems evolve in ac...

متن کامل

Multi-period network Data Envelopment Analysis to measure the efficiency of a real business

Measuring the efficiency of real businesses is not a simple task, because a real business may involve several processes and sub-processes, forming a very complicated dynamic network of interactions. In this paper, a customized dynamic network data envelopment analysis (NDEA) model is proposed to measure the efficiency of the sub-processes in a real business. The proposed dynamic NDEA model is f...

متن کامل

Estimating Network Structure and Propagation Dynamics for an Infectious Disease : Towards Effective Vaccine Allocation

In the event of a pandemic influenza outbreak, such as the 2009-2010 HINI "Swine Flu" episode, it is crucial to effectively allocate limited resources in order to minimize the casualties. Design of effective resource allocation strategies requires good understanding of the underlying contact network and of the propagation dynamics. In this thesis we develop a parameter estimation method that le...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013